Cartesian product
英 [kɑːˈtiːziən ˈprɒdʌkt]
美 [kɑːrˈtiːziən ˈprɑːdʌkt]
网络 笛卡兒積; 笛卡尔积; 笛卡儿积; 笛卡儿乘积; 笛卡尔乘积
双语例句
- A Popularize of Venn Diagraph in Cartesian Product
集合笛卡儿积集中文氏图的一种推广 - The Vertex Linear Arboricity of Complete Multiple Graphs and Cartesian Product Graphs
完全多部图和笛卡儿积图的线性点荫度 - It is proved that: ( 1) The cartesian product, the lexicographic product and the strong direct product in the products of connected graphs, are the path-positive graphs.
证明了：（1）如果G1和G2都是连通图，则积图中笛卡尔积，逻辑积和强直积都是道路正图。 - In this paper, A theorem for the binding number of multiple cartesian product of path and circuits is proven, and some limit properties of the binding number of multiple product graphs are presented.
本文证明了路与回路的多重笛卡尔乘积的联结数的一个定理，并给出了若干多重乘积图的联结数的极限性质。 - The main results of the paper are as follows: we not only prove that the Cartesian product of graphs of path and path, path and cycle satisfies the conjecture, but also give their coloring number.
本文的主要结果如下：我们不仅证明了路与路、路与圈的笛卡尔积图满足关联色数猜想，进而确定了它们的关联色数。 - Adjacent vertex-distinguishing VE-total coloring of Cartesian product graph of some graphs
部分图笛卡儿积图的邻点可区别VE-全染色 - Restricted Edge Connectivity of Cartesian Product and Direct Product Graphs
笛卡尔乘积图与直接乘积图的限制边连通性 - In this paper, a new result of Ky-Fan minimax theorem be obtained in Cartesian product H-space.
文章证明了Caresian乘积H-空间的一个新结果，并应用于ky-Fan极大极小定理的推广。 - The Adjacent-vertex Distinguishing Total-coloring Problem of Cartesian Product and Double Graph of Some Special Classes Graphs
一些特殊图类的笛卡尔积和倍图的邻点可区别的全染色问题 - It is more efficient to execute two statements than to return a Cartesian product of the two queries which would send the customer and order information repeated for each order line.
执行两条语句与返回这两个查询的笛卡儿积相比效率要高一些，后者将重复发送每个订购项的客户信息和订单信息。